基于 MPDE-EEMD 及自适应共振解调的轴承故障特征提取方法

针对滚动轴承振动信号具有非线性、非平稳性和非高斯性,并且故障特征往往淹没于系统噪声之中而难于识别的问题, 提出了以多种群差分进化(multiple population differential evolution, MPDE) 算法来改进集合经验模式分解( ensemble empirical mode decomposition, EEMD) 的 MPDE-EEMD 消噪方法,并与自适应共振解调技术( adaptive resonance demodulation technique, ARDT)相结合实现故障特征提取。 首先,为了解决 EEMD 中加入参数依靠人工选择且难以准确获取的问题,建立极值点分布 特性评价函数,利用 MPDE 来寻优获取最佳白噪声幅值,实现 EEMD 自适应分解。 然后,采用峭度与相关性相结合的准则对分 解后的 IMF 分量进行自动筛选,将满足条件的有效信号进行重构,实现对原始振动信号的降噪处理。 最后,采用 ARDT 自动确 定对消噪信号进行带通滤波的带宽和中心频率,再通过包络解调提取出滤波信号的特征频率。 将轴承仿真故障信号与实际故 障信号用于算法的验证,结果表明 MPDE-EEMD+ARDT 能有效提取出轴承故障特征。     

Comparative analysis of inbreeding parameters and runs of homozygosity islands in 2 Italian autochthonous cattle breeds mainly raised in the Parmigiano-Reggiano cheese production region

Reggiana and Modenese are autochthonous cattle breeds, reared in the North of Italy, that can be mainly distinguished for their standard coat color (Reggiana is red, whereas Modenese is white with some pale gray shades). Almost all milk produced by these breeds is transformed into 2 mono-breed branded Parmigiano-Reggiano cheeses, from which farmers receive the economic incomes needed for the sustainable conservation of these animal genetic resources. After the setting up of their herd books in 1960s, these breeds experienced a strong reduction in the population size that was subsequently reverted starting in the 1990s (Reggiana) or more recently (Modenese) reaching at present a total of about 2,800 and 500 registered cows, respectively. Due to the small population size of these breeds, inbreeding is a very important cause of concern for their conservation programs. Inbreeding is traditionally estimated using pedigree data, which are summarized in an inbreeding coefficient calculated at the individual level (F_PED). However, incompleteness of pedigree information and registration errors can affect the effectiveness of conservation strategies. High-throughput SNP genotyping platforms allow investigation of inbreeding using genome information that can overcome the limits of pedigree data. Several approaches have been proposed to estimate genomic inbreeding, with the use of runs of homozygosity (ROH) considered to be the more appropriate. In this study, several pedigree and genomic inbreeding parameters, calculated using the whole herd book populations or considering genotyping information (GeneSeek GGP Bovine 150K) from 1,684 Reggiana cattle and 323 Modenese cattle, were compared. Average inbreeding values per year were used to calculate effective population size. Reggiana breed had generally lower genomic inbreeding values than Modenese breed. The low correlation between pedigree-based and genomic-based parameters (ranging from 0.187 to 0.195 and 0.319 to 0.323 in the Reggiana and Modenese breeds, respectively) reflected the common problems of local populations in which pedigree records are not complete. The high proportion of short ROH over the total number of ROH indicates no major recent inbreeding events in both breeds. ROH islands spread over the genome of the 2 breeds (15 in Reggiana and 14 in Modenese) identified several signatures of selection. Some of these included genes affecting milk production traits, stature, body conformation traits (with a main ROH island in both breeds on BTA6 containing the ABCG2, NCAPG, and LCORL genes) and coat color (on BTA13 in Modenese containing the ASIP gene). In conclusion, this work provides an extensive comparative analysis of pedigree and genomic inbreeding parameters and relevant genomic information that will be useful in the conservation strategies of these 2 iconic local cattle breeds.     

基于动态行为学习的空中目标识别方法

针对空中移动目标识别问题,提出了一种基于动态行为学习的识别方法。首先,从数据源中提取目标要素,经过标注形成目标数据特征集;其次,基于应用场景进行特征组合,形成特征模型要素;然后,基于深度学习算法进行模型训练,得到评估最优的模型参数;最后,利用训练后的模型进行目标识别处理。通过数值仿真验证,该方法能够有效地识别无业务规则的目标身份。     

Key-Attributes-Based Ensemble Classifier for Customer Churn Prediction

Recently, it has been seen that the ensemble classifier is an effective way to enhance the prediction performance. However, it usually suffers from the problem of how to construct an appropriate classifier based on a set of complex data, for example, the data with many dimensions or hierarchical attributes. This study proposes a method to constructe an ensemble classifier based on the key attributes. In addition to its high-performance on precision shared by common ensemble classifiers, the calculation results are highly intelligible and thus easy for understanding. Furthermore, the experimental results based on the real data collected from China Mobile show that the key-attributes-based ensemble classifier has the good performance on both of the classifier construction and the customer churn prediction.     

Ensemble cluster pruning via convex-concave programming

Ensemble learning is the process of aggregating the decisions of different learners/models. Fundamentally, the performance of the ensemble relies on the degree of accuracy in individual learner predictions and the degree of diversity among the learners. The trade-off between accuracy and diversity within the ensemble needs to be optimized to provide the best grouping of learners as it relates to their performance. In this optimization theory article, we propose a novel ensemble selection algorithm which, focusing specifically on clustering problems, selects the optimal subset of the ensemble that has both accurate and diverse models. Those ensemble selection algorithms work for a given number of the best learners within the subset prior to their selection. The cardinality of a subset of the ensemble changes the prediction accuracy. The proposed algorithm in this study determines both the number of best learners and also the best ones. We compared our prediction results to recent ensemble clustering selection algorithms by the number of cardinalities and best predictions, finding better and approximated results to the optimum solutions.     

Applying Feature-Weighted Gradient Decent K-Nearest Neighbor to Select Promising Projects for Scientific Funding

Due to its outstanding ability in processing large quantity and high-dimensional data, machine learning models have been used in many cases, such as pattern recognition, classification, spam filtering, data mining and forecasting. As an outstanding machine learning algorithm, K-Nearest Neighbor (KNN) has been widely used in different situations, yet in selecting qualified applicants for winning a funding is almost new. The major problem lies in how to accurately determine the importance of attributes. In this paper, we propose a Feature-weighted Gradient Decent K-Nearest Neighbor (FGDKNN) method to classify funding applicants in to two types: approved ones or not approved ones. The FGDKNN is based on a gradient decent learning algorithm to update weight. It updatesthe weight of labels by minimizing error ratio iteratively, so that the importance of attributes can be described better. We investigate the performance of FGDKNN with Beijing Innofund. The results show that FGDKNN performs about 23%, 20%, 18%, 15% better than KNN, SVM, DT and ANN, respectively. Moreover, the FGDKNN has fast convergence time under different training scales, and has good performance under different settings.     

MOOC Learner’s Final Grade Prediction Based on an Improved Random Forests Method

Massive Open Online Course (MOOC) has become a popular way of online learning used across the world by millions of people. Meanwhile, a vast amount of information has been collected from the MOOC learners and institutions. Based on the educational data, a lot of researches have been investigated for the prediction of the MOOC learner’s final grade. However, there are still two problems in this research field. The first problem is how to select the most proper features to improve the prediction accuracy, and the second problem is how to use or modify the data mining algorithms for a better analysis of the MOOC data. In order to solve these two problems, an improved random forests method is proposed in this paper. First, a hybrid indicator is defined to measure the importance of the features, and a rule is further established for the feature selection; then, a Clustering-Synthetic Minority Over-sampling Technique (SMOTE) is embedded into the traditional random forests algorithm to solve the class imbalance problem. In experiment part, we verify the performance of the proposed method by using the Canvas Network Person-Course (CNPC) dataset. Furthermore, four well-known prediction methods have been applied for comparison, where the superiority of our method has been proved.     

Feature selection methods for root-cause analysis among top-level product attributes

Manufacturing companies not only strive to deliver flawless products but also monitor product failures in the field to identify potential quality issues. When product failures occur, quality engineers must identify the root cause to improve any affected product and process. This root-cause analysis can be supported by feature selection methods that identify relevant product attributes, such as manufacturing dates with an increased number of product failures. In this paper, we present different methods for feature selection and evaluate their ability to identify relevant product attributes in a root-cause analysis. First, we compile a list of feature selection methods. Then, we summarize the properties of product attributes in warranty case data and discuss these properties regarding the challenges they pose for machine learning algorithms. Next, we simulate datasets of warranty cases, which emulate these product properties. Finally, we compare the feature selection methods based on these simulated datasets. In the end, the univariate filter information gain is determined to be a suitable method for a wide range of applications. The comparison based on simulated data provides a more general result than other publications, which only focus on a single use case. Due to the generic nature of the simulated datasets, the results can be applied to various root-cause analysis processes in different quality management applications and provide a guideline for readers who wish to explore machine learning methods for their analysis of quality data.